Knapsack problem - PDFSEARCH.IO - Document Search Engine

Knapsack problem
Results: 111

#	Item
41	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
42	INFORMS INTERFACES Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn 1526-551X \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-11-21 02:25:22 Operations research Mathematical optimization Convex optimization Internet marketing Advertising Linear programming Television advertisement Pay per click Knapsack problem Theoretical computer science Applied mathematics Computational complexity theory
43	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
44	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
45	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:30:52 Dynamic programming Combinatorial optimization Cryptography Knapsack problem Operations research Algorithm Baby-step giant-step Ordinal arithmetic Mathematics Theoretical computer science Applied mathematics
46	The 118th RCKC Colloquium Search Result Diversification via Filling up Multiple Knapsacks Yu Haitao Add to Reading List Source URL: www.tsukuba.ac.jp Language: English - Date: 2014-12-09 20:27:32 Applied mathematics Combinatorial optimization Cryptography Dynamic programming Knapsack problem Mathematical optimization Optimization problem Recommender system Theoretical computer science Computational complexity theory Operations research
47	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
48	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
49	Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-07-08 12:40:54 NP-complete problems Operations research Combinatorial optimization Bin packing problem Knapsack problem Packing problem Algorithm Theoretical computer science Computational complexity theory Mathematics